On a canonical form for recurring sequences

A Note on the Jordan Canonical Form

A proof of the Jordan canonical form, suitable for a first course in linear algebra, is given. The proof includes the uniqueness of the number and sizes of the Jordan blocks. The value of the customary procedure for finding the block generators is also questioned. 2000 MSC: 15A21. The Jordan form of linear transformations is an exceeding useful result in all theoretical considerations regarding...

A Canonical Form for Circuit Diagrams

A canonical form for circuit diagrams with a designated start state is presented. The form is based upon nite automata minimization and Shannon's canonical form for boolean expressions.

A Canonical Framework for Sequences of Images

This paper deals with the problem of analysing sequences of images of rigid point objects taken by uncalibrated cameras. It is assumed that the correspondences between the points in the different images are known. The paper introduces a new framework for this problem. Corresponding points in a sequence of n images are related to each other by a fixed n-linear form. This form is an object invari...

A Rational Canonical Form Algorithm

Some remarks on the Brunovsky canonical form

Among the various canonical forms which were proposed for constant linear systems, the one due to Brunovsky [1] certainly is the most profound. It characterizes a dynamics modulo the group of static state feedbacks by a finite set of pure integrators. Its proof, which is quite computational, has been improved in various ways, and can be found in several textbooks (see, e.g., [12, 13, 20, 21] an...